منابع مشابه
Irreducibility and Deterministic r-th Root Finding over Finite Fields
Constructing r -th nonresidue over a nite eld is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree r e (where r is a prime) over a given nite eld Fq of characteristic p (equivalently, constructing the bigger eld Fqr e ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some ne...
متن کاملIrreducibility and r-th root finding over finite fields
Constructing r-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree re (where r is a prime) over a given finite field Fq of characteristic p (equivalently, constructing the bigger field Fqr ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some n...
متن کاملApproximation of the n-th Root of a Fuzzy Number by Polynomial Form Fuzzy Numbers
In this paper we introduce the root of a fuzzy number, and we present aniterative method to nd it, numerically. We present an algorithm to generatea sequence that can be converged to n-th root of a fuzzy number.
متن کاملGeneralized Gaussian Random Fields using hidden selections
We study non-Gaussian random fields constructed by the selection normal distribution, and we term them selection Gaussian random fields. The selection Gaussian random field can capture skewness, multi-modality, and to some extend heavy tails in the marginal distribution. We present a Metropolis-Hastings algorithm for efficient simulation of realizations from the random field, and a numerical al...
متن کاملThe Secant-Newton Map is Optimal Among Contracting $n^{th}$ Degree Maps for $n^{th}$ Root Computation
Consider the problem: given a real number x and an error bound ε, find an interval such that it contains n √ x and its width is less than ε. One way to solve the problem is to start with an initial interval and to repeatedly update it by applying an interval refinement map on it until it becomes narrow enough. In this paper, we prove that the well known Secant-Newton map is optimal among a cert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Mathematicae Silesianae
سال: 2019
ISSN: 2391-4238,0860-2107
DOI: 10.2478/amsil-2019-0012